Rewrite Systems with Constraints

Completion of Rewrite Systems with Membership Constraints

We consider a constraint system involving equations and membership constraints. Membership constraints are interpreted as the membership to some recognizable tree languages. The terms may contain a restricted kind of context variables. We give a set of constraint solving rules which is proved to be complete and terminating. This gives a uniication algorithm for an order-sorted logic (without an...

On Rewrite Constraints

Rewrite Systems

Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving

We consider a constraint system involving equations and membership constraints. Membership constraints are interpreted as the membership to some recognizable tree languages. The terms may contain a restricted kind of context variables. We give a set of constraint solving rules which is proved to be complete and terminating. This gives a uniication algorithm for an order-sorted logic (without an...

Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules

We consider a constrained equational logic where the constraints are membership conditions t 2 s where s is interpreted as a regular tree language. Our logic includes a fragment of second order equational logic (without projections) where second order variables range over regular sets of contexts. The problem with constrained equational logics is the failure of the critical pair lemma. That is ...